منابع مشابه
Maximum embedding of an H(v-w, 3, 1) into a TS(v, λ)
Let H be a subgraph of a graph G, and let V ⊆ X. We say that an H-design (V, C) of order u and index μ is embedded into a G-design (X,B) of order v and index λ, μ ≤ λ, if there is an injective mapping f : C → B such that B is a subgraph of f(B) for every B ∈ C. The mapping f is called the embedding of (V, C) into (X,B). For every pair of positive integers v, λ, we determine the minimum value of...
متن کاملOn Fuzzy KS-Semigroups
In this paper ,we fuzzify the new class of algebraic structure introduced by Kim[5].In this fuzzification(called fuzzy KS-semigroups),we introduce the notions of fuzzy sub KS-semigroups,fuzzy KS-ideal,fuzzy KS-p-ideal and investigate some of their related properties.The purpose of this study is to implement the fuzzy set theory and ideal theory in the KS-semigroups.This fuzzification leads to d...
متن کاملKaposi sarcoma (KS)-associated herpesvirus microRNA sequence analysis and KS risk in a European AIDS-KS case control study.
BACKGROUND We recently identified polymorphisms in Kaposi sarcoma-associated herpesvirus (KSHV)-encoded microRNA (miRNA) sequences from clinical subjects. Here, we examine whether any of these may contribute to KS risk in a European AIDS-KS case-control study. METHODS KSHV load in peripheral blood was determined by real-time quantitative polymerase chain reaction. Samples that had detectable ...
متن کاملA 100 KS / s 65 dB DR Σ − ∆ ADC with 0 . 65 V supply voltage
We present a low-power Σ − ∆ modulator to be used in the baseband sections of wireless sensor network receivers with 0.65V Vdd operation. The design is optimized for low-power consumption and low operating supply by minimizing operational amplifier open-loop gain. Simple differential pair amplifiers with ≈ 40dB of open loop gain and low noise factor are employed as the integrator cores and guar...
متن کاملKs, t-saturated bipartite graphs
An n-by-n bipartite graph is H-saturated if the addition of any missing edge between its two parts creates a new copy of H. In 1964, Erdős, Hajnal and Moon made a conjecture on the minimum number of edges in a Ks,s-saturated bipartite graph. This conjecture was proved independently by Wessel and Bollobás in a more general, but ordered, setting: they showed that the minimum number of edges in a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ecclesiastical Law Journal
سال: 2013
ISSN: 0956-618X,1751-8539
DOI: 10.1017/s0956618x13000082